BOUNDED-ANALYTIC SEQUENT CALCULI AND EMBEDDINGS FOR HYPERSEQUENT LOGICS

Abstract A sequent calculus with the subformula property has long been recognised as a highly favourable starting point for proof theoretic investigation of logic. However, most logics interest cannot be presented using property. In response, many formalisms more intricate than have formulated. this work we identify an alternative: retain but generalise to permit specific axiom substitutions and their subformulas. Our leads classification generalised properties is applied infinitely substructural, intermediate, modal (specifically: those cut-free hypersequent calculus). We also develop complementary perspective on in terms logical embeddings. This yields new complexity upper bounds contractive-mingle substructural situates isolated results so-called simple substitution within general theory.